A review on the quickest flow problem

Path problems were basically studied to find an alternate path that is, finding a second shortest route, if the route is blocked. The problem mainly focused on paths between vertices of given network. A new variant quickest problem, where predetermined data sent from source sink. flow relaxes limitations single multiple paths. In this paper we reviewed and problem. Later on, each clarified with certain examples.